Polynomial-Computable Representation of Neural Networks in Semantic Programming

نویسندگان

چکیده

A lot of libraries for neural networks are written Turing-complete programming languages such as Python, C++, PHP, and Java. However, at the moment, there no suitable implemented a p-complete logical language L. This paper investigates issues polynomial-computable representation this language, where basic elements hereditarily finite list elements, programs defined using special terms formulas mathematical logic. Such has been shown to exist multilayer feedforward fully connected with sigmoidal activation functions. To prove fact, p-iterative constructed that simulate operation network. result plays an important role in application L artificial intelligence algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dialogue Act Semantic Representation and Classification Using Recurrent Neural Networks

In this work, we present a model that incorporates Dialogue Act (DA) semantics in the framework of Recurrent Neural Networks (RNNs) for DA classification. Specifically, we propose a novel scheme for automatically encoding DA semantics via the extraction of salient keywords that are representative of the DA tags. The proposed model is applied to the Switchboard corpus and achieves 1.7% (absolute...

متن کامل

Prediction of Blasting Cost in Limestone Mines Using Gene Expression Programming Model and Artificial Neural Networks

The use of blasting cost (BC) prediction to achieve optimal fragmentation is necessary in order to control the adverse consequences of blasting such as fly rock, ground vibration, and air blast in open-pit mines. In this research work, BC is predicted through collecting 146 blasting data from six limestone mines in Iran using the artificial neural networks (ANNs), gene expression programming (G...

متن کامل

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

Knowledge Representation in Neural Networks

Recall the earlier definition of intelligence as doing the right thing at the right time, as judged by an outside human observer. As a key facilitator of intelligence, knowledge can then be defined as background information or general understanding (of a variety of domains) that enhances the ability to act intelligently, where domains include the natural, social, and even virtual worlds, as wel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: J

سال: 2023

ISSN: ['2571-8800']

DOI: https://doi.org/10.3390/j6010004